SLA Constrained Adaptive Scheduling of Parallel Jobs in a Computational Desktop Grid
نویسندگان
چکیده
Desktop grids are usually equipped with hundreds or thousands of desktops which use the idle cycles of desktop PCs of small enterprises and institutions. From conventional multi -site cluster grids, desktop grids vary markedly in terms of their dynamic nature. In terms of their dynamic nature such grids vary markedly from conventional grids] . This causes the need of new scheduling algorithms ,tailor-made for such systems . Such desktop grids become worthwhile research issue since the nature of these grids attract highly parallel algorithms ,designing efficient scheduling algorithms of parallel jobs on desktop grids . A SLA based adaptive scheduling framework (ASF) for desktop grids has been presented in this paper ,where based on a resource selection algorithm after SLA verification that set by the users tasks are assigned to different available grid resources . Based on a given set of parameter and previous execution log in an adaptive(flexible) manner the resource selection algorithm ,which works in an online mode, selects resources . Whether the user submitted jobs can be executed within the deadline and other constraints specified in the SLA or not the execution log decides . Choosing the most relevant computational parameter depending upon the tasks that are assigned to grid resources is also decided by it during task execution. Later, if performance of
منابع مشابه
A New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملUsing Moldability to Improve Scheduling Performance of Parallel Jobs on Computational Grid
In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, cannot fit in any single site due to the occupation of some resources by running jobs. How the job scheduler handles such situations is an important issue which has the potential to further improve the utilization of gr...
متن کاملA Bio-inspired Adaptive Job Scheduling Mechanism on a Computational Grid
A computational grid is a highly dynamic and distributed environment. Unlike tightly-coupled parallel computing environment, high performance computing on the grid is complicated by the heterogeneous computational performances of each node, possible node unavailability, unpredictable node behavior, and unreliable network connectivity. Compared to a static scheduling, an adaptive scheduling mech...
متن کاملAn Automated Performance Tuning Scheduling Framework for Computational Jobs in Desktop Grid
Tuning the performance of applications is a well studied field for parallel systems where the underlying architecture is known along with the interconnection pattern. The challenge of developers lies in effective utilization of application characteristics on specific architecture that leads to efficient deployment. But this process is highly manual demanding expertise to identify performance bo...
متن کاملAdaptive Processor Allocation for Moldable Jobs in Computational Grid
In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, cannot fit in any single site due to the occupation of some resources by running jobs. How the job scheduler handles such situations is an important issue which has the potential to further improve the utilization of gr...
متن کامل